Prefix Computations on Symmetric Multiprocessors

Prefix Computations on Symmetric Multiprocessors

We introduce a new prefix computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch targeted their algorithm for implementation ...

Preex Computations on Symmetric Multiprocessors (preliminary Draft)

We introduce a new optimal preex computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch targeted their algorithm for implemen...

A Memory Controller for Improved Performance of Streamed Computations on Symmetric Multiprocessors

The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance gap severely impacts streamorientated computations such as (de)compression, encryption, and scientific vector processing. This paper describes the development of an intelligent memory interface that can exploit compiler...

Symmetric Multiprocessors Shared-Memory Multiprocessors Synchronization

Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications

The paper presents eficient scalable algorithms for performing Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory (D S M) system with applications.